An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions

This paper presents an algorithm for solving the integer programming problem possessing a separable nonlinear objective function subject to linear constraints. The method is based on a generalization of the Balas implicit enumeration scheme. Computational experience is given for a set of seventeen linear and seventeen nonlinear test problems. The results indicate that the algorithm can solve the nonlinear integer programming problem in roughly the equivalent time required to solve the linear integer programming problem of similar size with existing algorithms. Although the algorithm is specifically designed to solve the nonlinear problem, the results indicate that the algorithm compares favorably with the Branch and Bound algorithm in the solution of linear integer programming problems.     

Book review

Jacques Fontanel, Les dépenses militaires et le désarmement, Editions Publisud, Paris, 1995, 136 pages.

Jean‐Paul Hébert ’Production d'armement — Mutilation du systéme français’, Paris 1995 La documentation française, 221 pages.     

Remaking the military industrial relationship: A French‐American comparison

Defense industrial complexes in leading Cold War nations have downsized and reallocated resources to other productive activities in the 1990s. In this paper, we analyze the experience of two key countries ‐ the US and France. Comparing the two countries, we find similar outcomes in budgetary retrenchment and large firm restructuring but marked differences in the pace of downsizing and diversification among small and medium‐sized firms. We hypothesize that three sets of contextual differences may explain these differences: 1) institutional differences in the way that the State bureaucracies ‐ the Pentagon and the French Délégation générale pour l'armement (DGA) ‐ oversee defense industrial matters, 2) differences in military industry ownership and firm size patterns, and 3) differences in the regional distribution of defense industrial capacity and associated regional policies. In closing, we note that the two countries’ defense industrial complexes are becoming more alike and speculate on the significance of invidious competition and interactions between them. We address briefly the future of French/American arms industrial competition and cooperation, given the trend towards transnational security arrangements and defense industry globalization     

Optimal replacement policies with two or more loaded sliding standbys

This article defines optimal replacement policies for identical components performing different functions in a given system, when more than one spare part is available. The problem is first formulated for two components and any number of spare parts and the optimal replacement time y(x) at time x is found to have a certain form. Sufficient conditions are then provided for y(x) to be a constant y* for x > y*, and y(x) = x for x > y* (single-critical-number policy). Under the assumption that the optimal policies are of the single-critical-number type, the results are extended to the n-component case, and a theorem is provided that reduces the required number of critical numbers. Finally, the theory is applied to the case of the exponential and uniform failure laws, in which single-critical-number policies are optimal, and to another failure law in which they are not.     

Budgetary savings from conscription and burden sharing in NATO

We study the spatial and temporal determinants of terrorism risk in Israel, using a geocoded database of Israeli terrorist attacks from 1949 to 2004. In selecting targets, terrorists seem to respond rationally to costs and benefits: they are more likely to hit targets more accessible from their own homebases and international borders, closer to symbolic centers of government administration, and in more heavily Jewish areas. We also examine the waiting time between attacks experienced by localities. Long periods without an attack signal lower risk for most localities, but higher risk for important areas such as regional or national capitals.     

Computational techniques for optimizing systems with standby redundancy

Three methods are used to solve the following problem: For P, a positive constant, maximize (P. Reliability-cost) of a system with standby redundancy. The results show that a method which rounds a noninteger solution to the nearest integer solution can lead to tremendous mistakes. However, neither a well known dynamic programming algorithm nor a previously developed branch and bound technique are able to solve large size problems. The solution of problems of large dimension thus requires the use of the noninteger solution of the first method to limit the number of possible solutions when using either the dynamic programming algorithm or a modified branch and bound technique. With this assistance, the branch and bound technique is able to solve large problems in a short amount of computational time.     

Optimal allocation of unreliable components for maximizing expected profit over time

In the present paper, we solve the following problem: Determine the optimum redundancy level to maximize the expected profit of a system bringing constant returns over a time period T; i. e., maximize the expression \documentclass{article}\pagestyle{empty}\begin{document}$ P\int_0^T {Rdt - C} $\end{document}, where P is the return of the system per unit of time, R the reliability of this system, C its cost, and T the period for which the system is supposed to work We present theoretical results so as to permit the application of a branch and bound algorithm to solve the problem. We also define the notion of consistency, thereby determining the distinction of two cases and the simplification of the algorithm for one of them.